def bubble_sort(arr):
    """
    Basic bubble sort algorithm. Time Complexity: O(n²) worst
    case, O(n) best case
    Space Complexity: O(1)
    """
    n = len(arr)
    # Traverse through all elements
    for i in range(n-1):
        for j in range(0, n - i - 1):
            if arr[j] > arr[j + 1]:
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
    return arr
# Example usage
numbers = [ 25, 11, 22, 12, 64, 90, 34 ]
sorted_numbers = bubble_sort(numbers.copy())
print("Sorted:", sorted_numbers)